/*

dp[i][j]=前i个数字添加j个乘号的最大值
dp[i][j]=max(
    dp[i][j],
    dp[k][j-1] * num[k+1][i]
)

num[i][i]=n[i]-'0'
num[i][j]=num[i][j-1]*10+(n[j]-'0')

dp[i][j] = -1e9
dp[i][0] = num[1][i]

*/


int main(){

}
